Computing the Strict Chebyshev Solution of Overdetermined Linear Equations

نویسنده

  • Nabih N. Abdelmalek
چکیده

A method for calculating the strict Chebyshev solution of overdetermined systems of linear equations using linear programming techniques is described. This method provides: (1) a way to determine, for the majority of cases, all the equations belonging to the characteristic set, (2) an efficient method to obtain the inverse of the matrix needed to calculate the strict Chebyshev solution, and (3) a way of recognizing when an element of the Chebyshev solution equals a corresponding element of the strict Chebyshev solution. As a result, in general, the computational effort is considerably reduced. Also the present method deals with full rank as well as rank deficient cases. Numerical results are given.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chebyshev Spectral Collocation Method for Computing Numerical Solution of Telegraph Equation

In this paper, the Chebyshev spectral collocation method(CSCM) for one-dimensional linear hyperbolic telegraph equation is presented. Chebyshev spectral collocation method have become very useful in providing highly accurate solutions to partial differential equations. A straightforward implementation of these methods involves the use of spectral differentiation matrices. Firstly, we transform ...

متن کامل

Positive solution of non-square fully Fuzzy linear system of equation in general form using least square method

In this paper, we propose the least-squares method for computing the positive solution of a $mtimes n$ fully fuzzy linear system (FFLS) of equations, where $m > n$, based on Kaffman's arithmetic operations on fuzzy numbers that introduced in [18]. First, we consider all elements of coefficient matrix are non-negative or non-positive. Also, we obtain 1-cut of the fuzzy number vector solution of ...

متن کامل

Solving the fractional integro-differential equations using fractional order Jacobi polynomials

In this paper, we are intend to present a numerical algorithm for computing approximate solution of linear and nonlinear Fredholm, Volterra and Fredholm-Volterra  integro-differential equations. The approximated solution is written in terms of fractional Jacobi polynomials. In this way, firstly we define Riemann-Liouville fractional operational matrix of fractional order Jacobi polynomials, the...

متن کامل

A fractional type of the Chebyshev polynomials for approximation of solution of linear fractional differential equations

In this paper we introduce a type of fractional-order polynomials based on the classical Chebyshev polynomials of the second kind (FCSs). Also we construct the operational matrix of fractional derivative of order $ gamma $ in the Caputo for FCSs and show that this matrix with the Tau method are utilized to reduce the solution of some fractional-order differential equations.

متن کامل

A New Algorithm for the Chebyshev Solution of Overdetermined Linear Systems

Let x(p) be the point which minimizes the residual of a linear system in the lv norm. It is known that under certain conditions x(p) —» x*, the Chebyshev or /„ solution, as p —y <*>. A differential equation describing x(p) is derived from which an iterative scheme is devised. A convergence analysis is given and numerical results are presented.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010